Comparison between Two Prototype Representation Schemes for a Nearest Neighbor Classifier
نویسنده
چکیده
2. Character Recognition System The paper is about the problem of finding good prototypes for a condensed nearest neighbor classifieiin a recognition system. A comparison study is done between two prototype representation schemes. The prototype search is done by a genetic algorithm which is able to generate novel prototypes (i.e. prototypes which are not among the training samples). I t is shown that the generalized representation scheme is more powerful, giving significantly larger normalized interclass distances. It is also shown that both representation schemes with genetic algorithm give significantly better prototypes than a direct prototype selection algorithm, which can select only among the training samples.
منابع مشابه
Prototype reduction techniques: A comparison among different approaches
The main two drawbacks of nearest neighbor based classifiers are: high CPU costs when the number of samples in the training set is high and performance extremely sensitive to outliers. Several attempts of overcoming such drawbacks have been proposed in the pattern recognition field aimed at selecting/gen-erating an adequate subset of prototypes from the training set. The problem addressed in th...
متن کاملOverlap pattern synthesis with an efficient nearest neighbor classifier
Nearest neighbor (NN) classifier is the most popular non-parametric classifier. It is a simple classifier with no design phase and shows good performance. Important factors affecting the efficiency and performance of NN classifier are (i) memory required to store the training set, (ii) classification time required to search the nearest neighbor of a given test pattern, and (iii) due to the curs...
متن کاملFusion of multiple approximate nearest neighbor classifiers for fast and efficient classification
The nearest neighbor classifier (NNC) is a popular non-parametric classifier. It is a simple classifier with no design phase and shows good performance. Important factors affecting the efficiency and performance of NNC are (i) memory required to store the training set, (ii) classification time required to search the nearest neighbor of a given test pattern, and (iii) due to the curse of dimensi...
متن کاملRBF-based neurodynamic nearest neighbor classification in real pattern space
Superposition of radial basis functions centered at given prototype patterns constitutes one of the most suitable energy forms for gradient systems that perform nearest neighbor classification with real-valued static prototypes. It is shown in this paper that a continuous-time dynamical neural network model, employing a radial basis function and a sigmoid multi-layer perceptron sub-networks, is...
متن کاملThe design of a nearest-neighbor classifier and its use for Japanese character recognition
The nearest neighbor (NN) approach is a powerfd nonparametric technique for pattern classification tasks. In this paper, algorithms for prototype reduction, hierarchical prototype organization and fast NN search are described. To remove redundant category prototypes and to avoid redundant comparisons, the algorithms exploit geometrical information of a given prototype set which is represented a...
متن کامل